A Tight Upper Bound of the Lumped Disk Seek Time for the Scan Disk Scheduling Policy

A tight upper bound of the lumped disk seek time for the Scan disk scheduling policy is presented. The tight upper bound is based on an accurate disk seek time model. One of the most important applications of the tight upper bound is in multimedia storage system design. Without a tight upper bound based on an accurate disk seek time model, the designers of multimedia storage systems would be forced to use more conservative approaches, i.e. loose upper bounds, to guarantee satisfaction of real-time requirements. This, in turn, would result in underutilization of disk bandwidth.